Upper bound on the frame error probability of terminated trellis codes
نویسندگان
چکیده
منابع مشابه
Upper Bound on the Error Probability for Space-Time Codes in Fast Fading Channels
−We present exact union bounds on the error probability of space-time codes in fast Rayleigh and Rician fading channels. Using Craig’s formula for the Gaussian Q-function, an exact pairwise error probability (PEP) of space-time codes is expressed in the form of a single finite-range integral whose integrand involves in the moment generating function (MGF) of a nonnegative random variable. Based...
متن کاملOn the Error Probability of General Trellis Codes with Applications to Sequential Decoding
An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of random L-branch binary trellis codes of rate R = l/n is given which separates the effects of the tail length T and the memory length M of the code. It is shown that the bound is independent of the length L of the information sequence when M 2 T + [nEvu(R)]-’ log, L. The implication that the actual...
متن کاملOn the error probability of general trellis codes with applications to sequential decoding (Corresp.)
An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of random L-branch binary trellis codes of rate R = l/n is given which separates the effects of the tail length T and the memory length M of the code. It is shown that the bound is independent of the length L of the information sequence when M 2 T + [nEvu(R)]-’ log, L. The implication that the actual...
متن کاملthe effects of error correction methods on pronunciation accuracy
هدف از انجام این تحقیق مشخص کردن موثرترین متد اصلاح خطا بر روی دقت آهنگ و تاکید تلفظ کلمه در زبان انگلیسی بود. این تحقیق با پیاده کردن چهار متد ارائه اصلاح خطا در چهار گروه، سه گروه آزمایشی و یک گروه تحت کنترل، انجام شد که گروه های فوق الذکر شامل دانشجویان سطح بالای متوسط کتاب اول passages بودند. گروه اول شامل 15، دوم 14، سوم 15 و آخرین 16 دانشجو بودند. دوره مربوطه به مدت 10 هفته ادامه یافت و د...
15 صفحه اولThe best possible upper bound on the probability of undetected error for linear codes of full support
Abstract—There is a known best possible upper bound on the probability of undetected error for linear codes. The [n, k; q] codes with probability of undetected error meeting the bound have support of size k only. In this note, linear codes of full support (= n) are studied. A best possible upper bound on the probability of undetected error for such codes is given, and the codes with probability...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 1998
ISSN: 1089-7798
DOI: 10.1109/4234.658610